A note on the Clustered Set Covering Problem
نویسندگان
چکیده
منابع مشابه
A note on the Clustered Set Covering Problem
We define an NP-hard clustered variant of the Set Covering Problem where subsets are partitioned into K clusters and a fixed cost is paid for selecting at least one subset in a given cluster. We show that the problem is approximable within ratio (1+ ǫ)(e/e− 1)H(q), where q is the maximum number of elements covered by a cluster and H(q) = ∑q i=1 1 i . Key-words: Integer Programming, Set Covering...
متن کاملApproximation of the Clustered Set Covering Problem
We define a NP-hard clustered variant of the Set Covering Problem where subsets are partitioned into K clusters and a fixed cost is paid for selecting at least one subset in a given cluster. This variant can reformulate as a master problem various multi-commodity flow problems in transportation planning. We show that the problem is approximable within ratio (1+2)(e/e−1)H(q), where q is the maxi...
متن کاملA Short Note on the Probabilistic Set Covering Problem
In this paper we address the following probabilistic version (PSC) of the set covering problem: min{cx | P(Ax ≥ ξ) ≥ p, xj ∈ {0, 1} j ∈ N} where A is a 0-1 matrix, ξ is a random 0-1 vector and p ∈ (0, 1] is the threshold probability level. In a recent development Saxena, Goyal and Lejeune proposed a MIP reformulation of (PSC) and reported extensive computational results with small and medium si...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملA note on the Covering Steiner Problem
A randomized approximation algorithm for the undirected and directed covering Steiner Problems is presented. The algorithm is based on a randomized reduction to a problem called 12 -Group Steiner. For the undirected case, the approximation ratio matches the approximation ratio of Konjevod et al. [KRS01]. However, our approach is a lot simpler. For the directed covering Steiner this gives an O(n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.11.030